Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f2(a, b) -> f2(a, c)
f2(c, d) -> f2(b, d)
Q is empty.
↳ QTRS
↳ Non-Overlap Check
Q restricted rewrite system:
The TRS R consists of the following rules:
f2(a, b) -> f2(a, c)
f2(c, d) -> f2(b, d)
Q is empty.
The TRS is non-overlapping. Hence, we can switch to innermost.
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f2(a, b) -> f2(a, c)
f2(c, d) -> f2(b, d)
The set Q consists of the following terms:
f2(a, b)
f2(c, d)
Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
F2(a, b) -> F2(a, c)
F2(c, d) -> F2(b, d)
The TRS R consists of the following rules:
f2(a, b) -> f2(a, c)
f2(c, d) -> f2(b, d)
The set Q consists of the following terms:
f2(a, b)
f2(c, d)
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ Non-Overlap Check
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
F2(a, b) -> F2(a, c)
F2(c, d) -> F2(b, d)
The TRS R consists of the following rules:
f2(a, b) -> f2(a, c)
f2(c, d) -> f2(b, d)
The set Q consists of the following terms:
f2(a, b)
f2(c, d)
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.